On-Line Matching Routing on Trees

Many-to-Many Routing on Trees via Matchings

In this paper we present an extensive study of many-to-many routing on trees under the matching routing model. Our study includes on-line and off-line algorithms. We present an asymptotically optimal on-line algorithm which routes k packets to their destination within d(k 1) + d f dist routing steps, where d is the degree of tree T on which the routing takes place and dist is the maximum distan...

Dynamic Tree Routing under the "Matching with Consumption" Model

In this paper we consider dynamic routing on trees under the \matching with consumption" routing model, a natural extension of the matching routing model introduced by Alon, Chung and Gra-ham 1, 2], which allows for the consumption of packets when they reach their destination. We present an asymptotically optimal on-line algorithm that routes k packets to their destination within d(k ? 1) + d d...

On-Line Routing in All-Optical Networks

The paper deals with on-line routing in WDM (wavelength division multiplexing) optical networks. A sequence of requests arrives over time, each is a pair of nodes to be connected by a path. The problem is to assign a wavelength and a path to each pair, so that no two paths sharing a link are assigned the same wavelength. The goal is to minimize the number of wavelengths used to establish all co...

On the Routing Number of Complete d-ARY Trees

We consider the routing number of trees, denoted by r£(), with respect to the matching routing model. For an arbitrary n-node tree T, it is known that rt(T) < 3n/2 + O(logn). In this paper, by providing a recursive off-line permutation routing algorithm, we show that the routing number of an n-node complete d-ary tree of height h(T) > 1 is bounded from above by n + o{n). This is near optimal si...

Routing on Trees under the Matching Model